By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Volume 18, Issue 5, pp. 859-1055

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Polynomial Time Algorithms for Finding Integer Relations among Real Numbers

J. Hastad, B. Just, J. C. Lagarias, and C. P. Schnorr

pp. 859-881

Ranking the Best Binary Trees

S. Anily and R. Hassin

pp. 882-892

An Analysis of the Rational Exponential Integral

G. W. Cherry

pp. 893-905

An Analysis of a Good Algorithm for the Subtree Problem, Corrected

Rakesh M. Verma and Steven W. Reyner

pp. 906-908

The Complete Convergence of Best Fit Decreasing

Wansoo T. Rhee and Michel Talagrand

pp. 909-918

The Complete Convergence of First Fit Decreasing

Wansoo T. Rhee and Michel Talagrand

pp. 919-938

Improved Time Bounds for the Maximum Flow Problem

Ravindra K. Ahuja, James B. Orlin, and Robert E. Tarjan

pp. 939-954

Very Fast Parallel Polynomial Arithmetic

Wayne Eberly

pp. 955-976

Topological Completeness in an Ideal Model for Polymorphic Types

Ernst-Erich Doberkat

pp. 977-989

The Distributed Firing Squad Problem

Brian A. Coan, Danny Dolev, Cynthia Dwork, and Larry Stockmeyer

pp. 990-1012

Faster Scaling Algorithms for Network Problems

Harold N. Gabow and Robert E. Tarjan

pp. 1013-1036

A New Base Change Algorithm for Permutation Groups

Cynthia A. Brown, Larry Finkelstein, and Paul W. Purdom, Jr.

pp. 1037-1047

Ratio Estimators are Maximum-Likelihood Estimators for Non-Context-Free Grammars

Keith Humenik

pp. 1048-1055